package 数组;

/**
 * @author tmh
 * @date 2024/9/7 22:46
 * @description
 */
public class T35搜索插入位置 {

    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        while (left <= right) {
            int mid = right + (left - right) >> 2;
            if (nums[mid] > target) {
                right = mid - 1;
            } else if (nums[mid] < target) {
                left = mid + 1;
            } else {
                return mid;
            }
        }
        return right + 1;
    }
}
